#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char s[maxn],ans[maxn];
LL d[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    cin>>(s+1);LL n=strlen(s+1);
    LL t;cin>>t;
    while(t--){
        LL l;cin>>l;LL r=n-l+1;
        d[l]++;d[r+1]--;
    }
    for(int i=1;i<=n;i++) d[i]+=d[i-1];
    for(int i=1;i<=n;i++){
        if(d[i]&1){
            ans[n-i+1]=s[i];
        }
        else ans[i]=s[i];
    }
    for(int i=1;i<=n;i++) cout<<ans[i];
    cout<<endl;
   	return 0;
}
